Almost locatedness in uniform spaces

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ALMOST S^{*}-COMPACTNESS IN L-TOPOLOGICAL SPACES

In this paper, the notion of almost S^{*}-compactness in L-topologicalspaces is introduced following Shi’s definition of S^{*}-compactness. The propertiesof this notion are studied and the relationship between it and otherdefinitions of almost compactness are discussed. Several characterizations ofalmost S^{*}-compactness are also presented.

متن کامل

On statistical type convergence in uniform spaces

The concept of ${mathscr{F}}_{st}$-fundamentality is introduced in uniform spaces, generated by some filter ${mathscr{F}}$. Its equivalence to the concept of ${mathscr{F}}$-convergence in uniform spaces is proved. This convergence generalizes many kinds of convergence, including the well-known statistical convergence.

متن کامل

Statistical uniform convergence in $2$-normed spaces

 The concept of statistical convergence in $2$-normed spaces for double sequence was introduced in [S. Sarabadan and S. Talebi, {it Statistical convergence of double sequences  in $2$-normed spaces }, Int. J. Contemp. Math. Sci. 6 (2011) 373--380]. In the first, we introduce concept strongly statistical convergence in $2$-normed spaces and generalize some results. Moreover,  we define the conce...

متن کامل

Uniform almost everywhere domination

We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a function of incomplete degree that dominates almost all degrees. This answers a question of Dobrinen and Simpson, who showed that such functions are related to the prooftheoretic strength of the regularity of Lebesgue measure for Gδ ...

متن کامل

Classifiers in Almost Empty Spaces

Recent developments in defining and training statistical classifiers make it possible to build reliable classifiers in very small sample size problems. Using these techniques advanced problems may be tackled, such as pixel based image recognition and dissimilarity based object classification. It will be explained and illustrated how recognition systems based on support vector machines and subsp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Czechoslovak Mathematical Journal

سال: 2007

ISSN: 0011-4642,1572-9141

DOI: 10.1007/s10587-007-0039-7